The smallest values of algebraic connectivity for unicyclic graphs
نویسندگان
چکیده
The algebraic connectivity ofG is the second smallest eigenvalue of its Laplacianmatrix. Let Un be the set of all unicyclic graphs of order n. In this paper, wewill provide the ordering of unicyclic graphs inUn up to the last seven graphs according to their algebraic connectivities when n ≥ 13. This extends the results of Liu and Liu [Y. Liu, Y. Liu, The ordering of unicyclic graphswith the smallest algebraic connectivity, DiscreteMath. 309 (2009) 4315–4325] and Guo [J.-M. Guo, A conjecture on the algebraic connectivity of connected graphs with fixed girth, Discrete Math. 308 (2008) 5702–5711]. © 2010 Elsevier B.V. All rights reserved.
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملEla the Minimum Algebraic Connectivity of Caterpillar Unicyclic Graphs
A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.
متن کاملEla on 3-colored Digraphs with Exactly One Nonsingular Cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملOn colored digraphs with exactly one nonsingular cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملThe Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity
The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let Bn be the set of all bicyclic graphs of order n. In this paper, we determine the last four bicyclic graphs (according to their smallest algebraic connectivities) among all graphs in Bn when n > 13. This result, together with our previous results on trees and unicyclic graphs, can be used to fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010